Weak Order Equivalence for Logic Programs with Preferences
نویسنده
چکیده
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively and were shown to be beneficial for modular programming and automated optimization. In [9], the novel notion of strong equivalence for logic programs with rule preferences (so-called ordered logic programs) has been defined and necessary and sufficient conditions for programs being strongly equivalent have been presented. In this paper, we extend this work and analyze a weaker notion of equivalence for ordered logic programs. Whereas strong equivalence makes great demands on ordered logic programs, the weakened notion enables program transformations for simplifying preference relations.
منابع مشابه
Strong Equivalence for Logic Programs with Preferences
Recently, strong equivalence for Answer Set Programming has been studied intensively, and was shown to be beneficial for modular programming and automated optimization. In this paper we define the novel notion of strong equivalence for logic programs with preferences. Based on this definition we give, for several semantics for preference handling, necessary and sufficient conditions for program...
متن کاملModular Equivalence for Normal Logic Programs
A Gaifman-Shapiro-style architecture of program modules is introduced in the case of normal logic programs under stable model semantics. The composition of program modules is suitably limited by module conditions which ensure the compatibility of the module system with stable models. The resulting module theorem properly strengthens Lifschitz and Turner’s splitting set theorem (1994) for normal...
متن کاملWeak Second Order Characterizations of Various Program Verification Systems
We show the equivalence (!{ LeivIIlII' .1' dUlfl/r;wr;zmion of Floyd-Hoare Logic in weak second order logic (fLeSSJ) with both Csirltl(lZ'S (f Cs80I) 111/(/ Selin's (f Sa85bJ) characterizations of Floyd-Hoare logic in Nonstandard Logics of Programs, Ow method allows us u) spell out tlJ.e precise role of the comprehension axiom in weak second order [og;I:. Ii .(~ then prove similar resultsIor ot...
متن کاملEquivalence in Abductive Logic
We consider the problem of identifying equivalence of two knowledge bases which are capable of abductive reasoning. Here, a knowledge base is written in either first-order logic or nonmonotonic logic programming. In this work, we will give two definitions of abductive equivalence. The first one, explainable equivalence, requires that two abductive programs have the same explainability for any o...
متن کاملAutomated Verification of Weak Equivalence within the SMODELS System
In answer set programming (ASP), a problem at hand is solved by (i) writing a logic program whose answer sets correspond to the solutions of the problem, and by (ii) computing the answer sets of the program using an answer set solver as a search engine. Typically, a programmer creates a series of gradually improving logic programs for a particular problem when optimizing program length and exec...
متن کامل